On stochastic programming I. Static linear programming under risk
نویسندگان
چکیده
منابع مشابه
Inverse Stochastic Linear Programming
Inverse optimization perturbs objective function to make an initial feasible solution optimal with respect to perturbed objective function while minimizing cost of perturbation. We extend inverse optimization to two-stage stochastic linear programs. Since the resulting model grows with number of scenarios, we present two decomposition approaches for solving these problems.
متن کاملOn solving stochastic linear programming problems
Solving a stochastic linear programming (SLP) problem involves selecting an SLP solver, transmitting the model data to the solver and retrieving and interpreting the results. After shortly introducing the SLP model classes in the first part of the paper we give a general discussion of these various facets of solving SLP problems. The second part consists of an overview on the model–solver conne...
متن کاملOn Stochastic Integer Programming under Probabilistic Constraints
We consider stochastic programming problems with probabilistic constraints in volving integer valued random variables The concept of p e cient points of a prob ability distribution is used to derive various equivalent problem formulations Next we modify the concept of r concave discrete probability distributions and analyse its relevance for problems under consideration These notions are used t...
متن کاملA Fuzzy-stochastic Approach for Binary Linear Programming under Uncertainties
This paper presents an innovative Fuzzy-Stochastic Approach (FSA) to solve Binary Linear Programming (BLP) problems under uncertainties. An Interval-coefficient Fuzzy Binary Linear Programming (IFBLP) model is applied here to reflect two different types of uncertainty in a BLP problem. In the proposed IFBLP model the interval coefficient is used to reflect parameter uncertainty, and the fuzzy g...
متن کاملStochastic 0-1 linear programming under limited distributional information
We consider the problem minx∈{0,1}n{cx : ajx ≤ bj , j = 1, . . . , m}, where the aj are random vectors with unknown distributions. The only information we are given regarding the random vectors aj are their moments, up to order k. We give a robust formulation, as a function of k, for the 0-1 integer linear program under this limited distributional information.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1968
ISSN: 0022-247X
DOI: 10.1016/0022-247x(68)90215-1